0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM 0.12/0.33 % Computer : n013.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1920 0.12/0.33 % WCLimit : 240 0.12/0.33 % DateTime : Wed Jul 30 08:24:49 EDT 2025 0.12/0.33 % CPUTime : 0.21/0.48 Running higher-order theorem proving 0.21/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.yOt2XhSGLa/E---3.1_2809.p 0.21/0.50 # Version: 3.0.0-ho 0.21/0.50 # Preprocessing class: HSSSSMSSSSMNSSN. 0.21/0.50 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.21/0.50 # Starting sh3 with 1200s (5) cores 0.21/0.50 # Starting ehoh_best8_lambda with 240s (1) cores 0.21/0.50 # Starting sh2lt with 240s (1) cores 0.21/0.50 # Starting ho_unfolding_1 with 240s (1) cores 0.21/0.50 # ho_unfolding_1 with pid 2890 completed with status 0 0.21/0.50 # Result found by ho_unfolding_1 0.21/0.50 # Preprocessing class: HSSSSMSSSSMNSSN. 0.21/0.50 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.21/0.50 # Starting sh3 with 1200s (5) cores 0.21/0.50 # Starting ehoh_best8_lambda with 240s (1) cores 0.21/0.50 # Starting sh2lt with 240s (1) cores 0.21/0.50 # Starting ho_unfolding_1 with 240s (1) cores 0.21/0.50 # No SInE strategy applied 0.21/0.50 # Search class: HHUNF-FFSF21-MSSFFFNN 0.21/0.50 # partial match(2): HHUNF-FFSF22-SSSFFFNN 0.21/0.50 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.21/0.50 # Starting new_ho_10 with 130s (1) cores 0.21/0.50 # new_ho_10 with pid 2895 completed with status 0 0.21/0.50 # Result found by new_ho_10 0.21/0.50 # Preprocessing class: HSSSSMSSSSMNSSN. 0.21/0.50 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.21/0.50 # Starting sh3 with 1200s (5) cores 0.21/0.50 # Starting ehoh_best8_lambda with 240s (1) cores 0.21/0.50 # Starting sh2lt with 240s (1) cores 0.21/0.50 # Starting ho_unfolding_1 with 240s (1) cores 0.21/0.50 # No SInE strategy applied 0.21/0.50 # Search class: HHUNF-FFSF21-MSSFFFNN 0.21/0.50 # partial match(2): HHUNF-FFSF22-SSSFFFNN 0.21/0.50 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.21/0.50 # Starting new_ho_10 with 130s (1) cores 0.21/0.50 # Preprocessing time : 0.001 s 0.21/0.50 # Presaturation interreduction done 0.21/0.50 0.21/0.50 # Proof found! 0.21/0.50 # SZS status Theorem 0.21/0.50 # SZS output start CNFRefutation 0.21/0.50 thf(decl_sort1, type, 'type/realax/real': $tType). 0.21/0.50 thf(decl_23, type, 'const/realax/real_sub': 'type/realax/real' > 'type/realax/real' > 'type/realax/real'). 0.21/0.50 thf(decl_24, type, 'const/realax/real_neg': 'type/realax/real' > 'type/realax/real'). 0.21/0.50 thf(decl_25, type, 'const/realax/real_add': 'type/realax/real' > 'type/realax/real' > 'type/realax/real'). 0.21/0.50 thf(decl_26, type, 'const/iterate/polynomial_function': ('type/realax/real' > 'type/realax/real') > $o). 0.21/0.50 thf(decl_27, type, esk1_0: 'type/realax/real' > 'type/realax/real'). 0.21/0.50 thf(decl_28, type, esk2_0: 'type/realax/real' > 'type/realax/real'). 0.21/0.50 thf('thm/iterate/POLYNOMIAL_FUNCTION_SUB_', conjecture, ![X1:'type/realax/real' > 'type/realax/real', X5:'type/realax/real' > 'type/realax/real']:(((('const/iterate/polynomial_function' @ X1)&('const/iterate/polynomial_function' @ X5))=>('const/iterate/polynomial_function' @ (^[X4:'type/realax/real']:('const/realax/real_sub' @ (X1 @ X4) @ (X5 @ X4)))))), file('/export/starexec/sandbox2/tmp/tmp.yOt2XhSGLa/E---3.1_2809.p', 'thm/iterate/POLYNOMIAL_FUNCTION_SUB_')). 0.21/0.50 thf('thm/realax/real_sub_', axiom, ![X6:'type/realax/real', X2:'type/realax/real']:((('const/realax/real_sub' @ X6 @ X2)=('const/realax/real_add' @ X6 @ ('const/realax/real_neg' @ X2)))), file('/export/starexec/sandbox2/tmp/tmp.yOt2XhSGLa/E---3.1_2809.p', 'thm/realax/real_sub_')). 0.21/0.50 thf('thm/iterate/POLYNOMIAL_FUNCTION_ADD_', axiom, ![X1:'type/realax/real' > 'type/realax/real', X3:'type/realax/real' > 'type/realax/real']:(((('const/iterate/polynomial_function' @ X3)&('const/iterate/polynomial_function' @ X1))=>('const/iterate/polynomial_function' @ (^[X4:'type/realax/real']:('const/realax/real_add' @ (X1 @ X4) @ (X3 @ X4)))))), file('/export/starexec/sandbox2/tmp/tmp.yOt2XhSGLa/E---3.1_2809.p', 'thm/iterate/POLYNOMIAL_FUNCTION_ADD_')). 0.21/0.50 thf('thm/iterate/POLYNOMIAL_FUNCTION_NEG_', axiom, ![X1:'type/realax/real' > 'type/realax/real']:((('const/iterate/polynomial_function' @ (^[X2:'type/realax/real']:('const/realax/real_neg' @ (X1 @ X2))))<=>('const/iterate/polynomial_function' @ X1))), file('/export/starexec/sandbox2/tmp/tmp.yOt2XhSGLa/E---3.1_2809.p', 'thm/iterate/POLYNOMIAL_FUNCTION_NEG_')). 0.21/0.50 thf(c_0_4, negated_conjecture, ~(![X1:'type/realax/real' > 'type/realax/real', X5:'type/realax/real' > 'type/realax/real']:(((('const/iterate/polynomial_function' @ X1)&('const/iterate/polynomial_function' @ X5))=>('const/iterate/polynomial_function' @ (^[Z0/* 23 */:'type/realax/real']:('const/realax/real_sub' @ (X1 @ Z0) @ (X5 @ Z0))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['thm/iterate/POLYNOMIAL_FUNCTION_SUB_'])])). 0.21/0.50 thf(c_0_5, negated_conjecture, ((('const/iterate/polynomial_function' @ esk1_0)&('const/iterate/polynomial_function' @ esk2_0))&~('const/iterate/polynomial_function' @ (^[Z0/* 23 */:'type/realax/real']:('const/realax/real_sub' @ (esk1_0 @ Z0) @ (esk2_0 @ Z0))))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])). 0.21/0.50 thf(c_0_6, plain, ![X19:'type/realax/real', X20:'type/realax/real']:((('const/realax/real_sub' @ X19 @ X20)=('const/realax/real_add' @ X19 @ ('const/realax/real_neg' @ X20)))), inference(variable_rename,[status(thm)],['thm/realax/real_sub_'])). 0.21/0.50 thf(c_0_7, plain, ![X1:'type/realax/real' > 'type/realax/real', X3:'type/realax/real' > 'type/realax/real']:(((('const/iterate/polynomial_function' @ X3)&('const/iterate/polynomial_function' @ X1))=>('const/iterate/polynomial_function' @ (^[Z0/* 25 */:'type/realax/real']:('const/realax/real_add' @ (X1 @ Z0) @ (X3 @ Z0)))))), inference(fof_simplification,[status(thm)],['thm/iterate/POLYNOMIAL_FUNCTION_ADD_'])). 0.21/0.50 thf(c_0_8, negated_conjecture, ~(('const/iterate/polynomial_function' @ (^[Z0/* 23 */:'type/realax/real']:('const/realax/real_sub' @ (esk1_0 @ Z0) @ (esk2_0 @ Z0))))), inference(split_conjunct,[status(thm)],[c_0_5])). 0.21/0.50 thf(c_0_9, plain, ![X2:'type/realax/real', X4:'type/realax/real']:((('const/realax/real_sub' @ X2 @ X4)=('const/realax/real_add' @ X2 @ ('const/realax/real_neg' @ X4)))), inference(split_conjunct,[status(thm)],[c_0_6])). 0.21/0.50 thf(c_0_10, plain, ![X15:'type/realax/real' > 'type/realax/real', X16:'type/realax/real' > 'type/realax/real']:((~('const/iterate/polynomial_function' @ X16)|~('const/iterate/polynomial_function' @ X15)|('const/iterate/polynomial_function' @ (^[Z0/* 25 */:'type/realax/real']:('const/realax/real_add' @ (X15 @ Z0) @ (X16 @ Z0)))))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])). 0.21/0.50 thf(c_0_11, plain, ![X1:'type/realax/real' > 'type/realax/real']:((('const/iterate/polynomial_function' @ (^[Z0/* 24 */:'type/realax/real']:('const/realax/real_neg' @ (X1 @ Z0))))<=>('const/iterate/polynomial_function' @ X1))), inference(fof_simplification,[status(thm)],['thm/iterate/POLYNOMIAL_FUNCTION_NEG_'])). 0.21/0.50 thf(c_0_12, negated_conjecture, ~(('const/iterate/polynomial_function' @ (^[Z0/* 25 */:'type/realax/real']:('const/realax/real_add' @ (esk1_0 @ Z0) @ ('const/realax/real_neg' @ (esk2_0 @ Z0)))))), inference(rw,[status(thm)],[c_0_8, c_0_9])). 0.21/0.50 thf(c_0_13, plain, ![X1:'type/realax/real' > 'type/realax/real', X3:'type/realax/real' > 'type/realax/real']:((('const/iterate/polynomial_function' @ (^[Z0/* 25 */:'type/realax/real']:('const/realax/real_add' @ (X3 @ Z0) @ (X1 @ Z0))))|~(('const/iterate/polynomial_function' @ X1))|~(('const/iterate/polynomial_function' @ X3)))), inference(split_conjunct,[status(thm)],[c_0_10])). 0.21/0.50 thf(c_0_14, negated_conjecture, ('const/iterate/polynomial_function' @ esk1_0), inference(split_conjunct,[status(thm)],[c_0_5])). 0.21/0.50 thf(c_0_15, plain, ![X14:'type/realax/real' > 'type/realax/real']:(((~('const/iterate/polynomial_function' @ (^[Z0/* 24 */:'type/realax/real']:('const/realax/real_neg' @ (X14 @ Z0))))|('const/iterate/polynomial_function' @ X14))&(~('const/iterate/polynomial_function' @ X14)|('const/iterate/polynomial_function' @ (^[Z0/* 24 */:'type/realax/real']:('const/realax/real_neg' @ (X14 @ Z0))))))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])). 0.21/0.50 thf(c_0_16, negated_conjecture, ~(('const/iterate/polynomial_function' @ (^[Z0/* 24 */:'type/realax/real']:('const/realax/real_neg' @ (esk2_0 @ Z0))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14])])). 0.21/0.50 thf(c_0_17, plain, ![X1:'type/realax/real' > 'type/realax/real']:((('const/iterate/polynomial_function' @ (^[Z0/* 24 */:'type/realax/real']:('const/realax/real_neg' @ (X1 @ Z0))))|~(('const/iterate/polynomial_function' @ X1)))), inference(split_conjunct,[status(thm)],[c_0_15])). 0.21/0.50 thf(c_0_18, negated_conjecture, ('const/iterate/polynomial_function' @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_5])). 0.21/0.50 thf(c_0_19, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18])]), ['proof']). 0.21/0.50 # SZS output end CNFRefutation 0.21/0.50 # Parsed axioms : 9 0.21/0.50 # Removed by relevancy pruning/SinE : 0 0.21/0.50 # Initial clauses : 12 0.21/0.50 # Removed in clause preprocessing : 6 0.21/0.50 # Initial clauses in saturation : 6 0.21/0.50 # Processed clauses : 13 0.21/0.50 # ...of these trivial : 0 0.21/0.50 # ...subsumed : 0 0.21/0.50 # ...remaining for further processing : 13 0.21/0.50 # Other redundant clauses eliminated : 0 0.21/0.50 # Clauses deleted for lack of memory : 0 0.21/0.50 # Backward-subsumed : 0 0.21/0.50 # Backward-rewritten : 0 0.21/0.50 # Generated clauses : 3 0.21/0.50 # ...of the previous two non-redundant : 1 0.21/0.50 # ...aggressively subsumed : 0 0.21/0.50 # Contextual simplify-reflections : 0 0.21/0.50 # Paramodulations : 3 0.21/0.50 # Factorizations : 0 0.21/0.50 # NegExts : 0 0.21/0.50 # Equation resolutions : 0 0.21/0.50 # Disequality decompositions : 0 0.21/0.50 # Total rewrite steps : 2 0.21/0.50 # ...of those cached : 0 0.21/0.50 # Propositional unsat checks : 0 0.21/0.50 # Propositional check models : 0 0.21/0.50 # Propositional check unsatisfiable : 0 0.21/0.50 # Propositional clauses : 0 0.21/0.50 # Propositional clauses after purity: 0 0.21/0.50 # Propositional unsat core size : 0 0.21/0.50 # Propositional preprocessing time : 0.000 0.21/0.50 # Propositional encoding time : 0.000 0.21/0.50 # Propositional solver time : 0.000 0.21/0.50 # Success case prop preproc time : 0.000 0.21/0.50 # Success case prop encoding time : 0.000 0.21/0.50 # Success case prop solver time : 0.000 0.21/0.50 # Current number of processed clauses : 7 0.21/0.50 # Positive orientable unit clauses : 2 0.21/0.50 # Positive unorientable unit clauses: 0 0.21/0.50 # Negative unit clauses : 2 0.21/0.50 # Non-unit-clauses : 3 0.21/0.50 # Current number of unprocessed clauses: 0 0.21/0.50 # ...number of literals in the above : 0 0.21/0.50 # Current number of archived formulas : 0 0.21/0.50 # Current number of archived clauses : 7 0.21/0.50 # Clause-clause subsumption calls (NU) : 2 0.21/0.50 # Rec. Clause-clause subsumption calls : 2 0.21/0.50 # Non-unit clause-clause subsumptions : 0 0.21/0.50 # Unit Clause-clause subsumption calls : 1 0.21/0.50 # Rewrite failures with RHS unbound : 0 0.21/0.50 # BW rewrite match attempts : 0 0.21/0.50 # BW rewrite match successes : 0 0.21/0.50 # Condensation attempts : 13 0.21/0.50 # Condensation successes : 0 0.21/0.50 # Termbank termtop insertions : 703 0.21/0.50 # Search garbage collected termcells : 124 0.21/0.50 0.21/0.50 # ------------------------------------------------- 0.21/0.50 # User time : 0.005 s 0.21/0.50 # System time : 0.002 s 0.21/0.50 # Total time : 0.006 s 0.21/0.50 # Maximum resident set size: 1800 pages 0.21/0.50 0.21/0.50 # ------------------------------------------------- 0.21/0.50 # User time : 0.007 s 0.21/0.50 # System time : 0.003 s 0.21/0.50 # Total time : 0.010 s 0.21/0.50 # Maximum resident set size: 1728 pages 0.21/0.50 % E exiting 0.21/0.51 % E exiting 0.21/0.51 EOF